0.06/0.11 % Problem : SLH519^1 : TPTP v7.5.0. Released v7.5.0. 0.06/0.12 % Command : run_E %s %d THM 0.11/0.32 % Computer : n003.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 30 0.11/0.32 % WCLimit : 30 0.11/0.32 % DateTime : Tue Aug 9 03:08:51 EDT 2022 0.11/0.32 % CPUTime : 0.17/0.44 The problem SPC is TH0_THM_EQU_NAR 0.17/0.44 Running higher-order on 1 cores theorem proving 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.17/0.44 # Version: 3.0pre003-ho 0.17/0.49 # Preprocessing class: HSLSSMSSSSMNHSA. 0.17/0.49 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.17/0.49 # Starting sh1 with 30s (1) cores 0.17/0.49 # sh1 with pid 25427 completed with status 0 0.17/0.49 # Result found by sh1 0.17/0.49 # Preprocessing class: HSLSSMSSSSMNHSA. 0.17/0.49 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.17/0.49 # Starting sh1 with 30s (1) cores 0.17/0.49 # No SInE strategy applied 0.17/0.49 # Search class: HGHSM-FSLM31-MHSFFSBN 0.17/0.49 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.17/0.49 # Starting almost_fo_1 with 17s (1) cores 0.17/0.49 # almost_fo_1 with pid 25428 completed with status 0 0.17/0.49 # Result found by almost_fo_1 0.17/0.49 # Preprocessing class: HSLSSMSSSSMNHSA. 0.17/0.49 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.17/0.49 # Starting sh1 with 30s (1) cores 0.17/0.49 # No SInE strategy applied 0.17/0.49 # Search class: HGHSM-FSLM31-MHSFFSBN 0.17/0.49 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.17/0.49 # Starting almost_fo_1 with 17s (1) cores 0.17/0.49 # Preprocessing time : 0.006 s 0.17/0.49 # Presaturation interreduction done 0.17/0.49 0.17/0.49 # Proof found! 0.17/0.49 # SZS status Theorem 0.17/0.49 # SZS output start CNFRefutation 0.17/0.49 thf(decl_22, type, condit1627435690bove_a: (a > a > $o) > set_a > $o). 0.17/0.49 thf(decl_23, type, condit1001553558elow_a: (a > a > $o) > set_a > $o). 0.17/0.49 thf(decl_24, type, finite40241356em_a_a: (a > a > a) > $o). 0.17/0.49 thf(decl_25, type, finite_finite_set_a: set_set_a > $o). 0.17/0.49 thf(decl_26, type, finite_finite_a: set_a > $o). 0.17/0.49 thf(decl_27, type, abel_semigroup_a: (a > a > a) > $o). 0.17/0.49 thf(decl_28, type, semigroup_a: (a > a > a) > $o). 0.17/0.49 thf(decl_29, type, semilattice_a: (a > a > a) > $o). 0.17/0.49 thf(decl_30, type, lattic247676691_fin_a: (a > a > a) > set_a > a). 0.17/0.49 thf(decl_31, type, lattic1885654924_set_a: (a > a > a) > $o). 0.17/0.49 thf(decl_32, type, lattic1781219155_fin_a: (a > a > a) > set_a > a). 0.17/0.49 thf(decl_33, type, modula1936294176_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 0.17/0.49 thf(decl_34, type, bot_bot_set_set_a: set_set_a). 0.17/0.49 thf(decl_35, type, bot_bot_set_a: set_a). 0.17/0.49 thf(decl_36, type, least_a: (a > a > $o) > (a > $o) > a). 0.17/0.49 thf(decl_37, type, max_a: (a > a > $o) > a > a > a). 0.17/0.49 thf(decl_38, type, min_a: (a > a > $o) > a > a > a). 0.17/0.49 thf(decl_39, type, ord_le318720350_set_a: set_set_a > set_set_a > $o). 0.17/0.49 thf(decl_40, type, ord_less_eq_set_a: set_a > set_a > $o). 0.17/0.49 thf(decl_41, type, greatest_a: (a > a > $o) > (a > $o) > a). 0.17/0.49 thf(decl_42, type, antimono_a_set_a: (a > a > $o) > (a > set_a) > $o). 0.17/0.49 thf(decl_43, type, mono_a_set_a: (a > a > $o) > (a > set_a) > $o). 0.17/0.49 thf(decl_44, type, transp_a: (a > a > $o) > $o). 0.17/0.49 thf(decl_45, type, collect_set_a: (set_a > $o) > set_set_a). 0.17/0.49 thf(decl_46, type, collect_a: (a > $o) > set_a). 0.17/0.49 thf(decl_47, type, insert_set_a: set_a > set_set_a > set_set_a). 0.17/0.49 thf(decl_48, type, insert_a: a > set_a > set_a). 0.17/0.49 thf(decl_49, type, set_atLeastAtMost_a: (a > a > $o) > a > a > set_a). 0.17/0.49 thf(decl_50, type, set_atLeast_a: (a > a > $o) > a > set_a). 0.17/0.49 thf(decl_51, type, set_atMost_a: (a > a > $o) > a > set_a). 0.17/0.49 thf(decl_52, type, member_set_a: set_a > set_set_a > $o). 0.17/0.49 thf(decl_53, type, member_a: a > set_a > $o). 0.17/0.49 thf(decl_54, type, a2: a). 0.17/0.49 thf(decl_55, type, b: a). 0.17/0.49 thf(decl_56, type, c: a). 0.17/0.49 thf(decl_57, type, inf: a > a > a). 0.17/0.49 thf(decl_58, type, less_eq: a > a > $o). 0.17/0.49 thf(decl_59, type, sup: a > a > a). 0.17/0.49 thf(decl_60, type, esk1_0: a). 0.17/0.49 thf(decl_61, type, esk2_0: a). 0.17/0.49 thf(decl_62, type, esk3_0: a). 0.17/0.49 thf(decl_63, type, esk4_0: a). 0.17/0.49 thf(decl_64, type, esk5_0: a). 0.17/0.49 thf(decl_65, type, esk6_0: a). 0.17/0.49 thf(decl_66, type, esk7_2: (a > $o) > (a > $o) > a). 0.17/0.49 thf(decl_67, type, esk8_1: (a > a > a) > a). 0.17/0.49 thf(decl_68, type, esk9_1: (a > a > a) > a). 0.17/0.49 thf(decl_69, type, esk10_1: (a > a > a) > a). 0.17/0.49 thf(decl_70, type, esk11_1: (a > a > a) > a). 0.17/0.49 thf(decl_71, type, esk12_1: (a > a > a) > a). 0.17/0.49 thf(decl_72, type, esk13_1: (a > a > a) > a). 0.17/0.49 thf(decl_73, type, esk14_1: (a > a > a) > a). 0.17/0.49 thf(decl_74, type, esk15_1: (a > a > a) > a). 0.17/0.49 thf(decl_75, type, esk16_1: (a > a > a) > a). 0.17/0.49 thf(decl_76, type, esk17_1: (a > a > a) > a). 0.17/0.49 thf(decl_77, type, esk18_1: (a > a > a) > a). 0.17/0.49 thf(decl_78, type, esk19_1: (a > a > a) > a). 0.17/0.49 thf(decl_79, type, esk20_1: (a > a > a) > a). 0.17/0.49 thf(decl_80, type, esk21_1: (a > a > a) > a). 0.17/0.49 thf(decl_81, type, esk22_2: (a > $o) > a > a). 0.17/0.49 thf(decl_82, type, esk23_3: (a > $o) > a > (a > $o) > a). 0.17/0.49 thf(decl_83, type, esk24_2: (a > $o) > a > a). 0.17/0.49 thf(decl_84, type, esk25_2: (a > $o) > a > a). 0.17/0.49 thf(decl_85, type, esk26_2: (a > $o) > a > a). 0.17/0.49 thf(decl_86, type, esk27_2: (a > $o) > a > a). 0.17/0.49 thf(decl_87, type, esk28_2: (a > $o) > a > a). 0.17/0.49 thf(decl_88, type, esk29_2: (a > $o) > a > a). 0.17/0.49 thf(decl_89, type, esk30_3: (a > $o) > a > (a > $o) > a). 0.17/0.49 thf(decl_90, type, esk31_2: (a > $o) > a > a). 0.17/0.49 thf(decl_91, type, esk32_1: set_a > a). 0.17/0.49 thf(decl_92, type, esk33_2: set_a > a > a). 0.17/0.49 thf(decl_93, type, esk34_1: set_a > a). 0.17/0.49 thf(decl_94, type, esk35_2: set_a > a > a). 0.17/0.49 thf(decl_95, type, esk36_2: set_a > a > a). 0.17/0.49 thf(decl_96, type, esk37_2: set_a > a > a). 0.17/0.49 thf(decl_97, type, esk38_1: (a > a > a) > a). 0.17/0.49 thf(decl_98, type, esk39_1: (a > a > a) > a). 0.17/0.49 thf(decl_99, type, esk40_1: (a > a > a) > a). 0.17/0.49 thf(decl_100, type, esk41_1: (a > a > a) > a). 0.17/0.49 thf(decl_101, type, esk42_1: (a > a > a) > a). 0.17/0.49 thf(decl_102, type, esk43_1: (a > a > a) > a). 0.17/0.49 thf(decl_103, type, esk44_2: set_a > a > a). 0.17/0.49 thf(decl_104, type, esk45_2: set_a > a > a). 0.17/0.49 thf(decl_105, type, esk46_1: (a > set_a) > a). 0.17/0.49 thf(decl_106, type, esk47_1: (a > set_a) > a). 0.17/0.49 thf(decl_107, type, esk48_1: (a > set_a) > a). 0.17/0.49 thf(decl_108, type, esk49_1: (a > set_a) > a). 0.17/0.49 thf(decl_109, type, esk50_1: (a > set_a) > a). 0.17/0.49 thf(decl_110, type, esk51_1: (a > set_a) > a). 0.17/0.49 thf(decl_111, type, esk52_1: (a > set_a) > a). 0.17/0.49 thf(decl_112, type, esk53_1: (a > set_a) > a). 0.17/0.49 thf(decl_113, type, esk54_1: set_a > a). 0.17/0.49 thf(decl_114, type, esk55_1: set_a > a). 0.17/0.49 thf(decl_115, type, esk56_2: set_a > a > a). 0.17/0.49 thf(decl_116, type, esk57_2: set_a > a > a). 0.17/0.49 thf(decl_117, type, esk58_2: set_a > a > a). 0.17/0.49 thf(decl_118, type, esk59_2: set_a > a > a). 0.17/0.49 thf(decl_119, type, esk60_1: (a > $o) > a). 0.17/0.49 thf(decl_120, type, esk61_1: (a > $o) > a). 0.17/0.49 thf(decl_121, type, esk62_1: set_set_a > set_a). 0.17/0.49 thf(decl_122, type, esk63_1: set_a > a). 0.17/0.49 thf(decl_123, type, esk64_2: set_set_a > set_set_a > set_a). 0.17/0.49 thf(decl_124, type, esk65_2: set_a > set_a > a). 0.17/0.49 thf(decl_125, type, esk66_1: set_set_a > set_a). 0.17/0.49 thf(decl_126, type, esk67_1: set_a > a). 0.17/0.49 thf(decl_127, type, esk68_1: set_set_a > set_a). 0.17/0.49 thf(decl_128, type, esk69_1: set_a > a). 0.17/0.49 thf(decl_129, type, esk70_2: (a > $o) > (a > $o) > a). 0.17/0.49 thf(decl_130, type, esk71_2: (a > $o) > (a > $o) > a). 0.17/0.49 thf(decl_131, type, esk72_2: set_set_a > set_set_a > set_a). 0.17/0.49 thf(decl_132, type, esk73_2: set_a > set_a > a). 0.17/0.49 thf(decl_133, type, esk74_2: set_set_a > set_set_a > set_a). 0.17/0.49 thf(decl_134, type, esk75_2: set_a > set_a > a). 0.17/0.49 thf(decl_135, type, esk76_1: set_a > a). 0.17/0.49 thf(decl_136, type, esk77_1: set_a > a). 0.17/0.49 thf(decl_137, type, esk78_1: set_a > a). 0.17/0.49 thf(decl_138, type, esk79_1: set_a > a). 0.17/0.49 thf(decl_139, type, esk80_2: set_set_a > set_a > set_a). 0.17/0.49 thf(decl_140, type, esk81_2: set_set_a > set_a > set_a). 0.17/0.49 thf(decl_141, type, epred1_1: set_set_a > set_a > $o). 0.17/0.49 thf(decl_142, type, epred2_1: set_a > a > $o). 0.17/0.49 thf(fact_14_d__aux__def, axiom, ![X1:a, X2:a, X3:a]:(((modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3)=(sup @ (sup @ (inf @ X1 @ X2) @ (inf @ X2 @ X3)) @ (inf @ X3 @ X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_14_d__aux__def)). 0.17/0.49 thf(fact_6_local_Osup_Oassoc, axiom, ![X1:a, X2:a, X3:a]:(((sup @ (sup @ X1 @ X2) @ X3)=(sup @ X1 @ (sup @ X2 @ X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_6_local_Osup_Oassoc)). 0.17/0.49 thf(conj_0, conjecture, ((modula1936294176_aux_a @ inf @ sup @ b @ c @ a2)=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.17/0.49 thf(fact_1_local_Oinf_Ocommute, axiom, ![X1:a, X2:a]:(((inf @ X1 @ X2)=(inf @ X2 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1_local_Oinf_Ocommute)). 0.17/0.49 thf(fact_8_local_Osup_Oleft__commute, axiom, ![X2:a, X1:a, X3:a]:(((sup @ X2 @ (sup @ X1 @ X3))=(sup @ X1 @ (sup @ X2 @ X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_8_local_Osup_Oleft__commute)). 0.17/0.49 thf(fact_7_local_Osup_Ocommute, axiom, ![X1:a, X2:a]:(((sup @ X1 @ X2)=(sup @ X2 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_7_local_Osup_Ocommute)). 0.17/0.49 thf(c_0_6, plain, ![X853:a, X854:a, X855:a]:(((modula1936294176_aux_a @ inf @ sup @ X853 @ X854 @ X855)=(sup @ (sup @ (inf @ X853 @ X854) @ (inf @ X854 @ X855)) @ (inf @ X855 @ X853)))), inference(variable_rename,[status(thm)],[fact_14_d__aux__def])). 0.17/0.49 thf(c_0_7, plain, ![X825:a, X826:a, X827:a]:(((sup @ (sup @ X825 @ X826) @ X827)=(sup @ X825 @ (sup @ X826 @ X827)))), inference(variable_rename,[status(thm)],[fact_6_local_Osup_Oassoc])). 0.17/0.49 thf(c_0_8, negated_conjecture, ((modula1936294176_aux_a @ inf @ sup @ b @ c @ a2)!=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.17/0.49 thf(c_0_9, plain, ![X3:a, X2:a, X1:a]:(((modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3)=(sup @ (sup @ (inf @ X1 @ X2) @ (inf @ X2 @ X3)) @ (inf @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.17/0.49 thf(c_0_10, plain, ![X1:a, X2:a, X3:a]:(((sup @ (sup @ X1 @ X2) @ X3)=(sup @ X1 @ (sup @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.17/0.49 thf(c_0_11, plain, ![X812:a, X813:a]:(((inf @ X812 @ X813)=(inf @ X813 @ X812))), inference(variable_rename,[status(thm)],[fact_1_local_Oinf_Ocommute])). 0.17/0.49 thf(c_0_12, plain, ![X830:a, X831:a, X832:a]:(((sup @ X830 @ (sup @ X831 @ X832))=(sup @ X831 @ (sup @ X830 @ X832)))), inference(variable_rename,[status(thm)],[fact_8_local_Osup_Oleft__commute])). 0.17/0.49 thf(c_0_13, plain, ![X828:a, X829:a]:(((sup @ X828 @ X829)=(sup @ X829 @ X828))), inference(variable_rename,[status(thm)],[fact_7_local_Osup_Ocommute])). 0.17/0.49 thf(c_0_14, negated_conjecture, ((modula1936294176_aux_a @ inf @ sup @ b @ c @ a2)!=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.17/0.49 thf(c_0_15, plain, ![X3:a, X2:a, X1:a]:(((modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3)=(sup @ (inf @ X1 @ X2) @ (sup @ (inf @ X2 @ X3) @ (inf @ X3 @ X1))))), inference(rw,[status(thm)],[c_0_9, c_0_10])). 0.17/0.49 thf(c_0_16, plain, ![X2:a, X1:a]:(((inf @ X1 @ X2)=(inf @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.17/0.49 thf(c_0_17, plain, ![X1:a, X2:a, X3:a]:(((sup @ X1 @ (sup @ X2 @ X3))=(sup @ X2 @ (sup @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.17/0.49 thf(c_0_18, plain, ![X2:a, X1:a]:(((sup @ X1 @ X2)=(sup @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.17/0.49 thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15]), c_0_16]), c_0_17]), c_0_15]), c_0_16]), c_0_18])]), ['proof']). 0.17/0.49 # SZS output end CNFRefutation 0.17/0.49 # Parsed axioms : 315 0.17/0.49 # Removed by relevancy pruning/SinE : 0 0.17/0.49 # Initial clauses : 472 0.17/0.49 # Removed in clause preprocessing : 49 0.17/0.49 # Initial clauses in saturation : 423 0.17/0.49 # Processed clauses : 376 0.17/0.49 # ...of these trivial : 12 0.17/0.49 # ...subsumed : 90 0.17/0.49 # ...remaining for further processing : 274 0.17/0.49 # Other redundant clauses eliminated : 29 0.17/0.49 # Clauses deleted for lack of memory : 0 0.17/0.49 # Backward-subsumed : 1 0.17/0.49 # Backward-rewritten : 1 0.17/0.49 # Generated clauses : 28 0.17/0.49 # ...of the previous two non-redundant : 6 0.17/0.49 # ...aggressively subsumed : 0 0.17/0.49 # Contextual simplify-reflections : 0 0.17/0.49 # Paramodulations : 0 0.17/0.49 # Factorizations : 0 0.17/0.49 # NegExts : 0 0.17/0.49 # Equation resolutions : 29 0.17/0.49 # Propositional unsat checks : 0 0.17/0.49 # Propositional check models : 0 0.17/0.49 # Propositional check unsatisfiable : 0 0.17/0.49 # Propositional clauses : 0 0.17/0.49 # Propositional clauses after purity: 0 0.17/0.49 # Propositional unsat core size : 0 0.17/0.49 # Propositional preprocessing time : 0.000 0.17/0.49 # Propositional encoding time : 0.000 0.17/0.49 # Propositional solver time : 0.000 0.17/0.49 # Success case prop preproc time : 0.000 0.17/0.49 # Success case prop encoding time : 0.000 0.17/0.49 # Success case prop solver time : 0.000 0.17/0.49 # Current number of processed clauses : 244 0.17/0.49 # Positive orientable unit clauses : 47 0.17/0.49 # Positive unorientable unit clauses: 5 0.17/0.49 # Negative unit clauses : 5 0.17/0.49 # Non-unit-clauses : 187 0.17/0.49 # Current number of unprocessed clauses: 53 0.17/0.49 # ...number of literals in the above : 218 0.17/0.49 # Current number of archived formulas : 0 0.17/0.49 # Current number of archived clauses : 2 0.17/0.49 # Clause-clause subsumption calls (NU) : 6654 0.17/0.49 # Rec. Clause-clause subsumption calls : 5148 0.17/0.49 # Non-unit clause-clause subsumptions : 79 0.17/0.49 # Unit Clause-clause subsumption calls : 5 0.17/0.49 # Rewrite failures with RHS unbound : 0 0.17/0.49 # BW rewrite match attempts : 41 0.17/0.49 # BW rewrite match successes : 26 0.17/0.49 # Condensation attempts : 0 0.17/0.49 # Condensation successes : 0 0.17/0.49 # Termbank termtop insertions : 30616 0.17/0.49 0.17/0.49 # ------------------------------------------------- 0.17/0.49 # User time : 0.038 s 0.17/0.49 # System time : 0.008 s 0.17/0.49 # Total time : 0.046 s 0.17/0.49 # Maximum resident set size: 3712 pages 0.17/0.49 0.17/0.49 # ------------------------------------------------- 0.17/0.49 # User time : 0.048 s 0.17/0.49 # System time : 0.008 s 0.17/0.49 # Total time : 0.056 s 0.17/0.49 # Maximum resident set size: 2080 pages 0.17/0.49 EOF